Communication complexity of channels in general probabilistic theories.
نویسندگان
چکیده
The communication complexity of a quantum channel is the minimal amount of classical communication required for classically simulating the process of preparation, transmission through the channel, and subsequent measurement of a quantum state. At present, only little is known about this quantity. In this Letter, we present a procedure for systematically evaluating the communication complexity of channels in any general probabilistic theory, in particular, quantum theory. The procedure is constructive and provides the most efficient classical protocols. We illustrate this procedure by evaluating the communication complexity of a quantum depolarizing channel with some finite sets of quantum states and measurements.
منابع مشابه
Extension of Cube Attack with Probabilistic Equations and its Application on Cryptanalysis of KATAN Cipher
Cube Attack is a successful case of Algebraic Attack. Cube Attack consists of two phases, linear equation extraction and solving the extracted equation system. Due to the high complexity of equation extraction phase in finding linear equations, we can extract nonlinear ones that could be approximated to linear equations with high probability. The probabilistic equations could be considered as l...
متن کاملPolarization of Multi-Relay Channels: A Suitable Method for DF and CF Relaying with Orthogonal Receiver
Polar codes, that have been recently introduced by Arikan, are one of the first codes that achieved the capacity for vast numerous channels and they also have low complexity in symmetric memoryless channels. Polar codes are constructed based on a phenomenon called channel polarization. This paper discusses relay channel polarization in order to achieve the capacity and show that if inputs of tw...
متن کاملPower Allocation In Cooperative Relay Channels
This paper concerns power allocation in relay-assisted wireless channels for two-hop transmission. First, the transmitter sends the information to both the relay and receiver parts. Next, in the second hop, the transmitter cooperates with the relay to increase the received signal to noise ratio (SNR), assuming the relay makes use of the Amplify and Forward (AF) strategy. Moreover, it is assumed...
متن کاملGeneralised probabilistic theories and conic extensions of polytopes
Generalized probabilistic theories (GPT) provide a general framework that includes classical and quantum theories. It is described by a cone C and its dual C∗. We show that whether some one-way communication complexity problems can be solved within a GPT is equivalent to the recently introduced cone factorisation of the corresponding communication matrix M . We also prove an analogue of Holevo’...
متن کاملThe Information Content of Systems in General Physical Theories
What kind of object is a quantum state? Is it an object that encodes an exponentially growing amount of information (in the size of the system) or more akin to a probability distribution? It turns out that these questions are sensitive to what we do with the information. For example, Holevo’s bound tells us that n qubits only encode n bits of classical information but for certain communication ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Physical review letters
دوره 111 16 شماره
صفحات -
تاریخ انتشار 2013